Dispatching policy for manufacturing jobs and time-delay plots
نویسندگان
چکیده
منابع مشابه
Time Delay Plots of Unflavoured Baryons
We explore the usefulness of the existing relations between the S-matrix and time delay in characterizing baryon resonances in pionnucleon scattering. We draw attention to the fact that the existence of a positive maximum in time delay is a necessary criterion for the existence of a resonance and should be used as a constraint in conventional analyses which locate resonances from poles of the S...
متن کاملTime-variant Delay Effects Based on Recurrence Plots
Recurrence plots (RPs) are two-dimensional binary matrices used to represent patterns of recurrence in time series data, and are typically used to analyze the behavior of non-linear dynamical systems. In this paper, we propose a method for the generation of time-variant delay effects in which the recurrences in an RP are used to restructure an audio buffer. We describe offline and realtime syst...
متن کاملFinite time stabilization of time-delay nonlinear systems with uncertainty and time-varying delay
In this paper, the problem of finite-time stability and finite-time stabilization for a specific class of dynamical systems with nonlinear functions in the presence time-varying delay and norm-bounded uncertainty terms is investigated. Nonlinear functions are considered to satisfy the Lipchitz conditions. At first, sufficient conditions to guarantee the finite-time stability for time-delay nonl...
متن کاملStochastic Dispatching of Multi-priority Jobs to Heterogeneous Processors
A number of multi-priority jobs are to be processed on two heterogeneous processors. Of the jobs waiting in the buffer, jobs with the highest priority have the first option of being dispatched for processing when a processor becomes available. On each processor, the processing times of the jobs within each priority class are stochastic, but have known distributions with decreasing mean residual...
متن کاملDispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput
We consider online, nonpreemptive scheduling of equal-length jobs on parallel machines. Jobs have arbitrary release times and deadlines and a scheduler’s goal is to maximize the number of completed jobs (Pm | rj , pj = p | P 1− Uj). This problem has been previously studied under two distinct models. In the first, a scheduler must provide immediate notification to a released job as to whether it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Integrated Manufacturing
سال: 2007
ISSN: 0951-192X,1362-3052
DOI: 10.1080/09511920600786604